BDD-based reasoning in the fluent calculus - first results
نویسندگان
چکیده
The paper reports on first preliminary results and insights gained in a project aiming at implementing the fluent calculus using methods and techniques based on binary decision diagrams. After reporting on an initial experiment showing promising results we discuss our findings concerning various techniques and heuristics used to speed up the reasoning process.
منابع مشابه
A Theory of First-Order Counterfactual Reasoning
A new theory of evaluating counterfactual statements is presented based on the established predicate calculus formalism of the Fluent Calculus for reasoning about actions. The assertion of a counterfactual antecedent is axiomatized as the performance of a special action. An existing solution to the Ramification Problem in the Fluent Calculus, where indirect effects of actions are accounted for ...
متن کاملA New Equational Foundation for the Fluent Calculus
A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a fluent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that th...
متن کاملA New Equational Foundation for the Fluent Calculus Stream: Knowledge Representation and Non-monotonic Reasoning
A new equational foundation is presented for the Fluent Calculus , an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a uent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that the...
متن کاملA Logic-based Approach to Dynamic Programming
We present a first-order value iteration algorithm that addresses the scalability problem of classical dynamic programming techniques by logically partitioning the state space. An MDP is represented in the Probabilistic Fluent Calculus, that is a first-order language for reasoning about actions. Moreover, we develop a normalization algorithm that discovers and prunes redundant states. We have i...
متن کاملThe Concurrent, Continuous Fluent Calculus
The Fluent Calculus belongs to the established predicate calculus formalisms for reasoning about actions. Its underlying concept of state update axioms provides a solution to the basic representational and inferential Frame Problems in pure first-order logic. Extending a recent research result, we present a Fluent Calculus to reason about domains involving continuous change and where actions oc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.AI/0003047 شماره
صفحات -
تاریخ انتشار 2000